Finitary Sketches

نویسندگان

  • Jirí Adámek
  • Peter T. Johnstone
  • Johann A. Makowsky
  • Jirí Rosický
چکیده

Finitary sketches, i.e., sketches with nite-limit and nite-colimit specii-cations, are proved to be as strong as geometric sketches, i.e., sketches with nite-limit and arbitrary colimit speciications. Categories sketchable by such sketches are fully characterized in the innnitary rst-order logic: they are axiomatizable by-coherent theories, i.e., basic theories using nite conjunctions, countable disjunctions, and-nite quantiications. The latter result is absolute; the equivalence of geometric and nitary sketches requires (in fact, is equivalent to) the non-existence of measurable cardinals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite Satissability and Equivalence of Finitary Sketches Finite Satissability and Equivalence of Finitary Sketches

A translation from classical rst-order logic to sketches is given. This translation does not preserve model categories, as is usually required when one studies connections between sketches and classical string-based logic. However, the translation preserves the models in some strong sense (although it does not preserve the homomorphisms between the models). In particular, it preserves satissabi...

متن کامل

Proving Semantical Equivalence of Data Specifications

More than two decades ago, Peter Freyd introduced essentially algebraic specifications, a well-behaved generalization of algebraic specifications, allowing for equational partiality. These essentially algebraic specifications turn out to have a number of very interesting applications in computer science. In this paper, we present a deduction system for essentially algebraic specifications that ...

متن کامل

Definability, Canonical Models, and Compactness for Finitary Coalgebraic Modal Logic

This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T ) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logi...

متن کامل

Finitary Languages

The class of ω-regular languages provides a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually”. Finitary liveness was proposed by Alur and Henzinger as a stronger formulation of liveness [AH98]. It requires that there exists an unknown, fixed bound b...

متن کامل

Finitary Lie algebras

An algebra is called finitary if it consists of finite-rank transformations of a vector space. We classify finitary simple and finitary irreducible Lie algebras over an algebraically closed field of characteristic 6= 2, 3.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Log.

دوره 62  شماره 

صفحات  -

تاریخ انتشار 1997